A Generalization of Lappan’s Theorem to Higher Dimensional Complex Projective Space

In this paper, the authors discuss a generalization of Lappan’s theorem to higher dimensional complex projective space and get the following result: Let f be a holomorphic mapping of ? into Pⁿ(C), and let H₁, · · · , H_q be hyperplanes in general position in Pⁿ(C).Assume that sup {(1 ? |z|²)f^?(z) : z ∈ q[ j=1 f^?1(H_j )o < ∞,if q ≥ 2n² + 3, then f is normal.     

A scaling limit for the length of the longest cycle in a sparse random digraph

We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any .     

Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.     

给定度序列图的覆盖成本和反向覆盖成本的研究

具有n个顶点且度序列为(m,2,…,2,1,…,1)(1的重数为m)的连通图不止一个(这些图均为树),而每个树对应唯一一个段序列(l₁,l₂,…,l_m).通过对任意一树移动最长段的悬挂点到最短段悬挂点的方式得到另一树,比较前后两树的覆盖成本和反向覆盖成本,给出了具有最小覆盖成本和反向覆盖成本的极树,并且进一步给出了取得最小覆盖成本和反向覆盖成本的顶点.     

On the Brauer p-dimension of Henselian discrete valued fields of residual characteristic p > 0

Let $(K,v)$ be a Henselian discrete valued field with residue field $\stackrel{?}{K}$ of characteristic $p>0$, and ${\text{Brd}}_p(K)$ be the Brauer p-dimension of K. This paper shows that ${\text{Brd}}_p(K)\ge n$ if $[\stackrel{?}{K}:{\stackrel{?}{K}}^p]=p^n$, for some $n\in \mathbb{N}$. It proves that ${\text{Brd}}_p(K)=\infty$ if and only if $[\stackrel{?}{K}:{\stackrel{?}{K}}^p]=\infty$.     

On amenability of two-generator groups

A discrete group G is amenable if there exists a finitely additive probability measure on G which is invariant under left translations and is defined on all subsets of G. It is proved that if the group is generated by two elements and is amenable then there are words being relators whose most of the consecutive pairs of the letters belong to a certain four-element set of pairs. This fact is applied to reproving non-amenability of a braid group. The same group provides an example showing that such type of condition is not su?cient for amenabilty.     

Solvent‐free ring‐opening polymerization of lactones with hydrogen‐bonding bisurea catalyst

Development of effective organocatalysts for the living ring‐opening polymerization (ROP) of lactones is highly desired for the preparation of biocompatible and biodegradable polyesters with controlled microstructures and physical properties. Herein, a new class of hydrogen‐bond donating bisurea catalysts is reported for the ROP of lactones under solvent‐free conditions. ROP of lactones mediated by the bisurea/7‐methyl‐1,5,7‐triazabicyclo[4.4.0]dec‐5‐ene (MTBD) catalyst exhibits a living/controlled manner, affording the polymers and copolymers with the well‐defined structure, predictable molecular weight, narrow molecular weight distribution, and high selectivity for monomer at low catalyst loadings at ambient temperature. The possible mechanism of bisurea/MTBD‐catalyzed ROP of lactones is proposed, in which the bisurea activates the carbonyl group of lactones while MTBD facilitates the nucleophilic attack of the initiating/propagating alcohol by hydrogen bonding. Moreover, the poly(ε‐caprolactone‐co‐δ‐valerolactone) [P(CL‐co‐VL)] random copolymers with various compositions were synthesized using the bisurea/MTBD catalyst. The measurements of thermal properties and crystalline structure demonstrate that the CL and VL units are cocrystallized in the crystalline phase of P(CL‐co‐VL) copolymers. © 2018 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2019 , 57, 90–100     

Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that $\mathsf{P}(G_n??)$ does not converge as $n\to \infty$ (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices $\{1,\dots ,n\}$). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture.     

次线性期望下的一般中心极限定理

受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理.